Interval oriented multi-section techniques for global optimization
نویسندگان
چکیده
منابع مشابه
Efficient interval partitioning for constrained global optimization
1 Nanyang Technological University, School of Mechanical and Aerospace Engineering, Singapore, 2 New England Biolabs Inc., 240 County Road, Ipswich, MA [email protected] 3 Izmir Ekonomi Universitesi, Izmir, Turkey [email protected] 4 University of Szeged, Institute of Informatics, Szeged, Hungary [email protected] 5 Advanced Concepts Team, ESA/ESTEC, Noordwijk, The Netherlands Tam...
متن کاملNew interval methods for constrained global optimization
Interval analysis is a powerful tool which allows to design branch-and-bound algorithms able to solve many global optimization problems. In this paper we present new adaptive multisection rules which enable the algorithm to choose the proper multisection type depending on simple heuristic decision rules. Moreover, for the selection of the next box to be subdivided, we investigate new criteria. ...
متن کاملUncertain constrained optimization by interval-oriented algorithm
This paper deals with an interval-oriented approach to solve general interval constrained optimization problems. Generally, this type of problems has infinitely many compromise solutions. The aim of this approach is to obtain one of such solutions with higher accuracy and lower computational cost. The proposed algorithm is nothing but a different kind of branch and bound algorithm with multi-se...
متن کاملGlobal Optimization Techniques for Mixed Complementarity Problems
We investigate the theoretical and numerical properties of two global optimization techniques for the solution of mixed complementarity problems. More precisely, using a standard semismooth Newton-type method as a basic solver for complementarity problems, we describe how the performance of this method can be improved by incorporating two wellknown global optimization algorithms, namely a tunne...
متن کاملA Surprising Approach in Interval Global Optimization
The work advances a new class of global optimization methods, called graph subdivision methods, that are based on the simultaneous adaptive subdivision of both the function’s domain of definition and the range of values.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2009
ISSN: 0377-0427
DOI: 10.1016/j.cam.2008.05.025